Real Roots of Random Polynomials: Expectation and Repulsion

نویسندگان

  • HOI NGUYEN
  • VAN VU
چکیده

Let Pn(x) = ∑n i=0 ξix i be a Kac random polynomial where the coefficients ξi are iid copies of a given random variable ξ. Our main result is an optimal quantitative bound concerning real roots repulsion. This leads to an optimal bound on the probability that there is a real double root. As an application, we consider the problem of estimating the number of real roots of Pn, which has a long history and in particular was the main subject of a celebrated series of papers by Littlewood and Offord from the 1940s. We show, for a large and natural family of atom variables ξ, that the expected number of real roots of Pn(x) is exactly 2 π logn + C + o(1), where C is an absolute constant depending on the atom variable ξ. Prior to this paper, such a result was known only for the case when ξ is Gaussian.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Classifications of Random Polynomials

 Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...

متن کامل

On the Number of Real Roots of Random Polynomials

Roots of random polynomials have been studied exclusively in both analysis and probability for a long time. A famous result by Ibragimov and Maslova, generalizing earlier fundamental works of Kac and Erdős-Offord, showed that the expectation of the number of real roots is 2 π logn + o(logn). In this paper, we determine the true nature of the error term by showing that the expectation equals 2 π...

متن کامل

On the real roots of generalized Thue-Morse polynomials

In this article we investigate real roots of real polynomials. By results of M. Kac 8, 9, 10] we know that a polynomial of degree n has in average 2 log n real zeros. See also results of Edelman and Kostlan 5] on the same subject. Some 10 years later Erdds and OOord 7] proved that the mean number of real roots of a random polynomial of degree n with coeecients 1 is again 2 log n: This leads us ...

متن کامل

On the Expected Number of Real Roots of a System of Random Polynomial Equations

We unify and generalize several known results about systems of random polynomials. We first classify all orthogonally invariant normal measures for spaces of polynomial mappings. For each such measure we calculate the expected number of real zeros. The results for invariant measures extend to underdetermined systems, giving the expected volume for orthogonally invariant random real projective v...

متن کامل

A pr 2 01 5 Finite free convolutions of polynomials ∗

We study three convolutions of polynomials that are inspired by free probability. We define these to be the expected characteristic polynomials of certain random matrices. The symmetric additive and multiplicative convolutions have been studied for a century. The asymmetric additive convolution, and the connection of all of them with random matrices, appears new. We prove that these convolution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015